The Rank of the Jacobian of Modular Curves: Analytic Methods
ثبت نشده
چکیده
منابع مشابه
An Efficient Threshold Verifiable Multi-Secret Sharing Scheme Using Generalized Jacobian of Elliptic Curves
In a (t,n)-threshold secret sharing scheme, a secret s is distributed among n participants such that any group of t or more participants can reconstruct the secret together, but no group of fewer than t participants can do. In this paper, we propose a verifiable (t,n)-threshold multi-secret sharing scheme based on Shao and Cao, and the intractability of the elliptic curve discrete logar...
متن کاملGeneralized Jacobian and Discrete Logarithm Problem on Elliptic Curves
Let E be an elliptic curve over the finite field F_{q}, P a point in E(F_{q}) of order n, and Q a point in the group generated by P. The discrete logarithm problem on E is to find the number k such that Q = kP. In this paper we reduce the discrete logarithm problem on E[n] to the discrete logarithm on the group F*_{q} , the multiplicative group of nonzero elements of Fq, in the case where n | q...
متن کاملOn a unit group generated by special values of Siegel modular functions
There has been important progress in constructing units and Sunits associated to curves of genus 2 or 3. These approaches are based mainly on the consideration of properties of Jacobian varieties associated to hyperelliptic curves of genus 2 or 3. In this paper, we construct a unit group of the ray class field k6 of Q(exp(2πi/5)) modulo 6 with full rank by special values of Siegel modular funct...
متن کاملComputing genus 2 curves from invariants on the Hilbert moduli space
We give a new method for generating genus 2 curves over a finite field with a given number of points on the Jacobian of the curve. We define two new invariants for genus 2 curves as values of modular functions on the Hilbert moduli space and show how to compute them. We relate them to the usual three Igusa invariants on the Siegel moduli space and give an algorithm to construct curves using the...
متن کاملUsing the Matrix Method to Compute the Degrees of Freedom of Mechanisms
In this paper, some definitions and traditional formulas for calculating the mobility of mechanisms are represented, e.g. Grubler formula, Somov - Malyshev formula, and Buchsbaum - Freudenstei. It is discussed that there are certain cases in which they are too ambiguous and incorrect to use. However, a matrix method is suggested based on the rank of the Jacobian of the mechanism and its applica...
متن کامل